Implementing SASL using Categorical Multi-combinators

Partial Categorical Multi-Combinators and Church-Rosser Theorems

Categorical Multi Combinators form a rewriting system developed with the aim of providing e cient implementations of lazy functional languages The core of the system of Categorical Multi Combinators consists of only four rewriting laws with a very low pattern matching complexity This system allows the equivalent of several reductions to be performed at once as functions form frames with all the...

On the Equivalence Between CMC and TIM

In this paper we present the equivalence between TIM a machine developed to implement lazy functional programming languages and the set of Categorical Multi Combinators a rewriting system developed with similar aims

Simple Authentication and Security Layer Incorporating Extensible Authentication Protocol

There are many methods that support user authentication and access control, important roles in the establishment of secure communication. Particularly, we examine Simple Authentication and Security Layer (SASL) and Extensible Authentication Protocol (EAP) and propose EAP-Advanced Encryption Standard-Pre-Shared-Key (EAP-AESPSK). SASL is an authentication framework in connection-oriented protocol...

Categorical Combinators

Our main aim is to present the connection between 2-calculus and Cartesian closed categories both in an untyped and purely syntactic setting. More specifically we establish a syntactic equivalence theorem between what we call categorical com-binatory logic and j-calculus with explicit products and projections, with fl and q-rules as well as with surjective pairing. "Combinatory logic" is of cou...

Syntactic Multicategories and Categorical Combinators for Linear Logic (abstract)